Top Trading Cycles in Prioritized Matching: An Irrelevance of Priorities in Large Markets
نویسندگان
چکیده
We study top trading cycles in a two-sided matching environment (Abdulkadiroglu and Sonmez (2003)) under the assumption that individuals’ preferences and objects’ priorities are drawn iid uniformly. We show that the number of individuals/objects assigned at each round follows a simple Markov chain and we explicitly derive the transition probabilities. This Markov property is used to shed light on the role priorities play in TTC. We show that, as the market grows large, the effect of priorities in TTC disappears, leading in the limit to an assignment that entails virtually the same amount of justified envy as does RSD. JEL Classification Numbers: C70, D47, D61, D63.
منابع مشابه
Efficiency and Stability in Large Matching Markets
We study efficient and stable mechanisms in matching markets when the number of agents is large and individuals’ preferences are drawn randomly from a class of distributions allowing for both common and idiosyncratic components. In this context, as the market grows large, all Pareto efficient mechanisms—including top trading cycles, serial dictatorship, and their randomized variants—are asympto...
متن کاملAn Analysis of Top Trading Cycles in Two-Sided Matching Markets
We study top trading cycles in a two-sided matching environment (Abdulkadiroglu and Sonmez (2003)) under the assumption that individuals’ preferences and objects’ priorities are drawn iid uniformly. The distributions of agents’ preferences and objects’ priorities remaining after a given round of TTC depend nontrivially on the exact history of the algorithm up to that round (and so need not be u...
متن کاملTop Trading Cycles under General Capacities: A Characterization
We characterize the top trading cycles mechanism for priority-based allocation of indivisible objects when objects have general capacities. We say that a mechanism is top-priority trading-proof if the top ranked agent at any object can never benefit from obtaining (or trading for) a top priority of any agent assigned a copy of this object. This axiom captures a new way that top priorities are r...
متن کاملThe Role of Priorities in Assigning Indivisible Objects: A Characterization of Top Trading Cycles
The Top Trading Cycles mechanism emerges as a desirable solution in various market design applications. Yet recommendations are made without any rigorous foundation for the role priorities play in assignment. We explain that role by recursive individual rationality with respect to a priority structure. We show that a mechanism is Pareto efficient, strategy-proof and recursively individual ratio...
متن کاملTwo Simple Variations of Top Trading Cycles
Top Trading Cycles is widely regarded as the preferred method of assigning students to schools when the designer values efficiency over fairness. However, Top Trading Cycles has an undesirable feature when objects may be assigned to more than one agent as is the case in the school choice problem. If agent i’s most preferred object a has a capacity of qa, and i has one of the qa highest prioriti...
متن کامل